Designing Unimodular Codes Via Quadratic Optimization
نویسندگان
چکیده
منابع مشابه
Universal codes and unimodular lattices
Binary quadratic residue codes of length p + 1 produce via construction B and density doubling type II lattices like the Leech. Recently, quaternary quadratic residue codes have been shown to produce the same lattices by construction A modulo 4. We prove in a direct way the equivalence of these two constructions for p ~ 31. In dimension 32, we obtain an extremal lattice of type II not isometric...
متن کاملSolving quadratic equations using reduced unimodular quadratic forms
Let Q be an n × n symmetric matrix with integral entries and with detQ = 0, but not necesarily positive definite. We describe a generalized LLL algorithm to reduce this quadratic form. This algorithm either reduces the quadratic form or stops with some isotropic vector. It is proved to run in polynomial time. We also describe an algorithm for the minimization of a ternary quadratic form: when a...
متن کاملGlobal Quadratic Optimization via Conic Relaxation
We present a convex conic relaxation for a problem of maximizing an indefinite quadratic form over a set of convex constraints on the squared variables. We show that for all these problems we get at least 12 37 -relative accuracy of the approximation. In the second part of the paper we derive the conic relaxation by another approach based on the second order optimality conditions. We show that ...
متن کاملOptimizing Space-time Codes via Stochastic Optimization
Linear dispersion (LD) codes are a good candidate for high data rate MIMO signaling. Traditionally LD codes were designed by maximizing the average mutual information, which cannot guarantee good error performance. This paper presents a design scheme for LD codes that directly minimizes bit/block error probability in (possibly spatially correlated) fading MIMO channels with an arbitrary receive...
متن کاملNetwork Throughput Optimization via Error Correcting Codes
A new network construction method is presented for building of scalable, high throughput, low latency networks. The method is based on the exact equivalence discovered between the problem of maximizing network throughput (measured as bisection bandwidth) for a large class of practically interesting Cayley graphs and the problem of maximizing codeword distance for linear error correcting codes. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2014
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2013.2296883